Quantum universal variable-length source coding
نویسندگان
چکیده
We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of its exponent. In addition, its average error asymptotically tends to 0.
منابع مشابه
Simple construction of quantum universal variable-length source coding
We simply construct a quantum universal variable-length source code in which, independent of information source, both of the average error and the probability that the coding rate is greater than the entropy rate H(ρp), tend to 0. If H(ρp) is estimated, we can compress the coding rate to the admissible rate H(ρp) with a probability close to 1. However, when we perform a naive measurement for th...
متن کاملUniversal source coding for complementary delivery
This paper deals with a universal coding problem for a certain kind of multiterminal source coding system that we call the complementary delivery coding system. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and bounds of the error probabilities are clarified via type-theoretical and graph-theoretical ana...
متن کاملExponents of quantum fixed-length pure state source coding
We derive the optimal exponent of the error probability of the quantum fixedlength pure state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Josza et al. (PRL, 81, 1714 (1998))’s universal code. In the converse part, Nielsen and Kempe (PRL, 86, 5184 (2001))’s lemma is essential. In the direct part, a group representation theoretic...
متن کاملUniversal variable-to-fixed length source codes
A universal variable-to-fixed length algorithm for binary memoryless sources which converges to the entropy of the source at the optimal rate is known. We study the problem of universal variable-to-fixed length coding for the class of Markov sources with finite alphabets. We give an upper bound on the performance of the code for large dictionary sizes and show that the code is optimal in the se...
متن کاملUniversal coding for correlated sources over generalized complementary delivery networks
This paper deals with a universal coding problem for a certain kind of multiterminal source coding network called a generalized complementary delivery network. In this network, messages from multiple correlated sources are jointly encoded, and each decoder has access to some of the messages to enable it to reproduce the other messages. Both fixed-to-fixed length and fixed-to-variable length los...
متن کامل